How to average logarithmic retrievals?

How to screen the “ average - risk ” population ?

How to prove list membership in logarithmic time

In this paper we propose a novel technique for proving in zeroknowledge that a committed value is on a public list. Our technique combines the concept of a hashtree with well-known zero-knowledge proofs of knowledge. The resulting proof protocol has a time complexity logarithmic in the size of the list. Its soundness property is guaranteed under the discrete logarithm assumption, while the prov...

Fault Tolerance of Random Graphs with respect to Connectivity: Phase Transition in Logarithmic Average Degree

The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated. It is related to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown probability that a graph is disconnected after stochastic node removal. To establish a mean-field approximation for the model, the cavity method for finite sys...

How to Use Glutaraldehyde

 الهای متمادی است که سرویس های بهداشتی گلوتار آلدئید را بعنوان یک ماده استریل کننده برای وسایلی که نسبت به گرما حساس هستند مورد استفاده قرار می دهند. همزمان با افزایش تقاضا برای استفاده از اندوسکوپی، استفاده از گلوتار آلدئید و تماس با آن نیز افزایش یافته است. باید خاطر نشان ساخت گلوتار آلدئید می تواند سبب ایجاد حساسیت های پوستی، چشمی و تنفسی گردد که نهایتاً امکان دارد این حساسیت به آسم و رنیت آل...

How robust is quicksort average complexity?

The paper questions the robustness of average case time complexity of the fast and popular quicksort algorithm. Among the six standard probability distributions examined in the paper, only continuous uniform, exponential and standard normal are supporting it whereas the others are supporting the worst case complexity measure. To the question -why are we getting the worst case complexity measure...